ALGEBRAIC MULTIPLICATION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

متن کامل

Algebraic Methods for Fast Matrix Multiplication

An improvement upon the naive O(n3) algorithm for matrix multiplication was first presented by Strassen, obtaining the result in only O(n2.81) field operations [5]. This raises the question of what the best possible exponent k such that matrix multiplication can be carried out in at most O(nk) time is. Clearly k ≥ 2, since n2 is the size of the output. It is believed that the optimal k is exact...

متن کامل

Anti-holomorphic Multiplication and a Real Algebraic Modular Variety

An anti-holomorphic multiplication by the integers Od of a quadratic imaginary number field, on a principally polarized complex abelian variety AC is an action of Od on AC such that the purely imaginary elements act in an anti-holomorphic manner. The coarse moduli space XR of such A (with appropriate level structure) is shown to consist of finitely many isomorphic connected components, each of ...

متن کامل

Algebraic distance in algebraic cone metric spaces and its properties

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.

متن کامل

Fast Multiplication of the Algebraic Normal Forms of Two Boolean Functions

The contribution of this paper is twofold. Firstly, it proposes a simple algorithm which performs the multiplication of two n-variate boolean functions in their algebraic normal forms in O(n2) time and O(2) space. Secondly, it proposes a fast implementation (MultANFw) of the algorithm which works with w-bit words. Results for w = 8, 32 and 64 show that the 64-bit implementation is the fastest. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: School Science and Mathematics

سال: 1908

ISSN: 0036-6803

DOI: 10.1111/j.1949-8594.1908.tb01230.x